Relation Structure-Aware Heterogeneous Information Network Embedding
نویسندگان
چکیده
منابع مشابه
HINE: Heterogeneous Information Network Embedding
Network embedding has shown its effectiveness in embedding homogeneous networks. Compared with homogeneous networks, heterogeneous information networks (HINs) contain semantic information from multi-typed entities and relations, and are shown to be a more effective model for real world data. The existing network embedding methods fail to explicitly capture the semantics in HINs. In this paper, ...
متن کاملHeterogeneous Information Network Embedding for Recommendation
Due to the flexibility in modelling data heterogeneity, heterogeneous information network (HIN) has been adopted to characterize complex and heterogeneous auxiliary data in recommender systems, called HIN based recommendation. It is challenging to develop effective methods for HIN based recommendation in both extraction and exploitation of the information from HINs. Most of HIN based recommenda...
متن کاملCANE: Context-Aware Network Embedding for Relation Modeling
Network embedding (NE) is playing a critical role in network analysis, due to its ability to represent vertices with efficient low-dimensional embedding vectors. However, existing NE models aim to learn a fixed context-free embedding for each vertex and neglect the diverse roles when interacting with other vertices. In this paper, we assume that one vertex usually shows different aspects when i...
متن کاملGraph Embedding with Rich Information through Bipartite Heterogeneous Network
Graph embedding has attracted increasing attention due to its critical application in social network analysis. Most existing algorithms for graph embedding only rely on the typology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this paper, we proposed a novel and general framework of repre...
متن کاملHeterogeneous Information Network Embedding for Meta Path based Proximity
A network embedding is a representation of a large graph in a lowdimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity (i.e., similarity) between vertices in the original graph. This way, typical search and mining methods (e.g., similarity search, kNN retrieval, classification, clustering) can be applied in the embedded space wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33014456